Multilevel image threshold selection based on the shuffled frog-leaping algorithm

نویسنده

  • M. H. Horng
چکیده

Multilevel thresholding is an important technique for image processing and pattern recognition. The maximum entropy thresholding (MET) has been widely applied in the literature. In this paper, a new multilevel MET algorithm based on the technology of the shuffled frog-leaping (SFLO) algorithm is proposed: called the maximum entropy based shuffled frog-leaping algorithm thresholding (MESFLOT) method. The SFLO had been applied to solve the optimization problem such as image thresholding. Four different methods are compared to this proposed method: the particle swarm optimization (PSO), the hybrid cooperative-comprehensive learning based PSO algorithm (HCOCLPSO), the Fast Otsu’s method and the honey bee mating optimization (HBMO). The experimental results demonstrate that the proposed MESFLOT algorithm can search for multiple thresholds which are very close to the optimal ones examined by the exhaustive search method. Compared to the other four thresholding methods, the segmentation results of using the MESFLOT algorithm is the most, however, the computation time by using the MESFLOT algorithm is shorter than that of the other four methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combined Heat and Power Economic Dispatch using Improved Shuffled Frog Leaping Algorithm

Recently, Combined Heat and Power (CHP) systems have been utilized increasingly in power systems. With the addition penetration of CHP-based co-generation of electricity and heat, the determination of economic dispatch of power and heat becomes a more complex and challenging issue. The optimal operation of CHP-based systems is inherently a nonlinear and non-convex optimization problem with a lo...

متن کامل

Using the Modified Shuffled Frog Leaping Algorithm for Optimal Sizing and location of Distributed Generation Resources for Reliability Improvement

Restructuring the recent developments in the power system and problems arising from construction as well as the maintenance of large power plants lead to increase in using the Distributed Generation (DG) resources. DG units due to its specifications, technology and location network connectivity can improve system and load point reliability indices. In this paper, the allocation and sizing of di...

متن کامل

Shuffled Frog-Leaping Programming for Solving Regression Problems

There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...

متن کامل

Voltage Flicker Parameters Estimation Using Shuffled Frog Leaping Algorithm and Imperialistic Competitive Algorithm

Measurement of magnitude and frequency of the voltage flicker is very important for monitoring andcontrolling voltage flicker efficiently to improve the network power quality. This paper presents twonew methods for measurement of flicker signal parameters using Shuffled Frog Leaping Algorithm(SFLA) and Imperialist Competitive Algorithm (ICA). This paper estimates fundamental voltage andflicker ...

متن کامل

Genetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013